Axiomatization of a Branching Time Logic with Indistinguishability Relations
نویسنده
چکیده
Trees with indistinguishability relations provide a semantics for a temporal language “composed by” the Peircean tense operators and the Ockhamist modal operator. In this paper, a finite axiomatization with a non standard rule for this language interpreted over bundled trees with indistinguishability relations is given. This axiomatization is proved to be sound and strongly complete.
منابع مشابه
Bisimulation and p-morphism for branching-time logics with indistinguishability relations
In Zanardo, 1998, the Peircean semantics for branching-time logics is enriched with a notion of indistinguishability at a moment t between histories passing through t. Trees with indistinguishability relations provide a semantics for a temporal language with tense and modal operators. In this paper a notion of p-morphism and a notion of bisimulation, wrt this language and semantics, are given a...
متن کاملAn Axiomatization of a First-order Branching Time Temporal Logic
We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no finitary axiomatization. We offer a sound and strongly complete axiomatization for the considered logic.
متن کاملAn Axiomatization of Full Computation Tree Logic
We give a sound and complete axiomatization for the full computation tree logic, CTL*, of R-generable models. This solves a long standing open problem in branching time temporal logic. ?
متن کاملOn the intermediate logic of open subsets of metric spaces
In this paper we study the intermediate logic MLO(X ) of open subsets of a metric space X . This logic is closely related to Medvedev’s logic of finite problemsML. We prove several facts about this logic: its inclusion in ML, impossibility of its finite axiomatization and indistinguishability from ML within some large class of propositional formulas.
متن کاملTemporal logics with reference pointers and computation tree logics
A complete axiomatic system CTL rp is introduced for a temporal logic for nitely branching ! +-trees in a language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL into CTL rp. In particular, that yields a complete axiomatization for the translations of all valid CTL-formulae. Thus, the temporal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Philosophical Logic
دوره 45 شماره
صفحات -
تاریخ انتشار 2016